Multifractals of Normalized First Passage Time in Sierpinski Gasket
نویسنده
چکیده
The multifractal behavior of the normalized first passage time is investigated on the two dimensional Sierpinski gasket with both absorbing and reflecting barriers. The normalized first passage time for Sinai model and the logistic model to arrive at the absorbing barrier after starting from an arbitrary site, especially obtained by the calculation via the Monte Carlo simulation, is discussed numerically. The generalized dimension and the spectrum are also estimated from the distribution of the normalized first passage time, and compared with the results on the finitely square lattice.
منابع مشابه
Multifractal Measures Characterized by the Iterative Map with Two Control Parameters
A one dimensional iterative map with two control parameters, i.e. the Kim Kong map, is proposed. Our purpose is to investigate the characteristic properties of this map, and to discuss numerically the multifractal behavior of the normalized first passage time. Especially, based on the Monte Carlo simulation, the normalized first passage time to arrive at the absorbing barrier after starting fro...
متن کاملRandom walks on the Sierpinski Gasket
The generating functions for random walks on the Sierpinski gasket are computed. For closed walks, we investigate the dependence of these functions on location and the bare hopping parameter. They are continuous on the infinite gasket but not differentiable. J. Physique 47 (1986) 1663-1669 OCTOBRE 1986, Classification Physics Abstracts 05.40 05.50 1. Preliminaries and review of known results. C...
متن کاملDirac operators and geodesic metric on the harmonic Sierpinski gasket and other fractal sets
We construct Dirac operators and spectral triples for certain, not necessarily selfsimilar, fractal sets built on curves. Connes’ distance formula of noncommutative geometry provides a natural metric on the fractal. To motivate the construction, we address Kigami’s measurable Riemannian geometry, which is a metric realization of the Sierpinski gasket as a self-affine space with continuously dif...
متن کاملAcyclic Edge-coloring of Sierpinski-like Graphs
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by χ′a(G). Sierpinski graphs S(n, 3) are the graphs of the Tower of Hanoi with n disks, while Sierpinski gasket graphs Sn are the graphs naturally defined ...
متن کاملNew Sierpenski Curves in Complex Plane
The Sierpinski triangle also known as Sierpinski gasket is one of the most interesting and the simplest fractal shapes in existence. There are many different and easy ways to generate a Sierpinski triangle. In this paper we have presented a new algorithm for generating the sierpinski gasket using complex variables.
متن کامل